Application of Grasshopper Optimization Algorithm for Constrained and Unconstrained Test Functions
نویسندگان
چکیده
منابع مشابه
An Efficient Conjugate Gradient Algorithm for Unconstrained Optimization Problems
In this paper, an efficient conjugate gradient method for unconstrained optimization is introduced. Parameters of the method are obtained by solving an optimization problem, and using a variant of the modified secant condition. The new conjugate gradient parameter benefits from function information as well as gradient information in each iteration. The proposed method has global convergence und...
متن کاملA new hybrid conjugate gradient algorithm for unconstrained optimization
In this paper, a new hybrid conjugate gradient algorithm is proposed for solving unconstrained optimization problems. This new method can generate sufficient descent directions unrelated to any line search. Moreover, the global convergence of the proposed method is proved under the Wolfe line search. Numerical experiments are also presented to show the efficiency of the proposed algorithm, espe...
متن کاملConstrained Pseudorandom Functions for Unconstrained Inputs
A constrained pseudo random function (PRF) behaves like a standard PRF, but with the added feature that the (master) secret key holder, having secret key K, can produce a constrained key, K{f}, that allows for the evaluation of the PRF on all inputs satisfied by the constraint f . Most existing constrained PRF constructions can handle only bounded length inputs. In a recent work, Abusalah et al...
متن کاملA multi-objective improved teaching-learning based optimization algorithm for unconstrained and constrained optimization problems
Article history: Received July 2 2013 Received in revised format September 7 2013 Accepted September 15 2013 Available online September 23 2013 The present work proposes a multi-objective improved teaching-learning based optimization (MO-ITLBO) algorithm for unconstrained and constrained multi-objective function optimization. The MO-ITLBO algorithm is the improved version of basic teaching-lear...
متن کاملFirefly Algorithm for Unconstrained Optimization
Meta-heuristic algorithms prove to be competent in outperforming deterministic algorithms for real-world optimization problems. Firefly algorithm is one such recently developed algorithm inspired by the flashing behavior of fireflies. In this work, a detailed formulation and explanation of the Firefly algorithm implementation is given. Later Firefly algorithm is verified using six unimodal engi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Swarm Intelligence and Evolutionary Computation
سال: 2017
ISSN: 2090-4908
DOI: 10.4172/2090-4908.1000165